An Auditable Metering Scheme for Web Advertisement Applications
نویسندگان
چکیده
This paper proposes a cryptographic mechanism for metering the duration and/or the number of instances of running a data process. This mechanism has the following property: knowing a secret, one can validate a piece of metering evidence in constant units of time while without the secret the job of generating a valid piece of evidence requires time indicated by a value in the evidence. Because the mechanism utilises a well-known computational complexity problem, the meter based on it can be implemented in software yet is tamper-resistant. We will address the use of this mechanism in building an auditable metering scheme for finding the popularity of web sites. The scheme is suitable for rapidly increasing web advertisement applications. We will also discuss the related security issues and mention some other applications, which can benefit by using the mechanism.
منابع مشابه
Provably Secure Metering Scheme
Naor and Pinkas introduced metering schemes at Eurocrypt '98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number, say k, of clients. This paper rst shows an attack for their schemes such that only two malicious clients can prevent a s...
متن کاملAuditable Metering with Lightweight Security
In this work we suggest a new mechanism for metering the popularity of web-sites: The compact metering scheme. Our approach does not rely on client authentication or on a third party. Instead, we suggest the notion of a timing function, a computation that can be performed incrementally, whose output is compact, and whose result can be used to eeciently verify the eeort spent with high degree of...
متن کاملEecient Metering Schemes with Pricing
In order to decide on advertisement fees for web servers, Naor and Pinkas 7] introduced metering schemes. They proposed metering schemes in which any server is able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number, say h, of clients. Afterwards, the authors of 3] generalized the idea of Naor and Pinkas and proposed metering schem...
متن کاملApplying General Access Structure to Metering Schemes
In order to decide on advertisement fees for web servers, Naor and Pinkas [15] introduced metering schemes secure against coalition of corrupt servers and clients. In their schemes any server is able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number of clients. After that in series of papers Masucci et. al. [1–3, 13, 14] generaliz...
متن کاملSecure and Eecient Metering
We consider an environment in which many servers serve an even larger number of clients (e.g. the web), and it is required to meter the interaction between servers and clients. More speciically, it is desired to count the number of clients that were served by a server. A major possible application is to measure the popularity of web pages in order to decide on advertisement fees. The metering p...
متن کامل